Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method
نویسنده
چکیده
The process scheduling, is one of the most important tasks of the operating system. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly. In this paper, a nonlinear programming mathematical model is developed to determine the optimum value of the time quantum, in order to minimize the average waiting time of the processes. The model is implemented and solved by Lingo 8.0 software on four selected problems from the literature.
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملOptimal Round Robin CPU Scheduling Algorithm using Manhattan Distance
Received Mar 23, 2017 Revised Sep 8, 2017 Accepted Sep 25, 2017 In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. If time quantum is too large, the response time of the processes is ...
متن کاملAn Optimum Time Quantum Using Linguistic Synthesis for Round Robin Scheduling Algorithm
In Round Robin CPU scheduling algorithm the main concern is with the size of time quantum and the increased waiting and turnaround time. Decision for these is usually based on parameters which are assumed to be precise. However, in many cases the values of these parameters are vague and imprecise. The performance of fuzzy logic depends upon the ability to deal with Linguistic variables. With th...
متن کاملStatistical Approach to Determine Most Efficient Value for Time Quantum in round Robin Scheduling
Scheduling various processes is one of the most fundamental functions of the operating system. In that context one of the most common scheduling algorithms used in most operating systems is the Round Robin method in which, the ready processes waiting in the ready queue, take control of the processor for a short period of time known as the time quantum (or time slice) circularly. Here we discuss...
متن کاملFinding Time Quantum of round Robin Cpu Scheduling Algorithm in General Computing Systems Using Integer Programming
In Round Robin Scheduling, the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads res...
متن کامل